A railroad maintenance problem solved with a cut and column generation matheuristic
نویسندگان
چکیده
In this paper we address a real life optimization problem, the Rail Track Inspection Scheduling Problem (RTISP). This problem consists of scheduling railway network inspection tasks. The objective is to minimize the total deadhead distance while performing all inspection tasks. Different 0-1 integer formulations for the problem are presented. A heuristic based on both Benders and Dantzig-Wolfe decompositions is proposed to solve this rich arc routing problem. Its performance is analyzed on a real life dataset provided by the French national railway company (SNCF). The proposed algorithm is compared to a dynamic programming-based heuristic. Its ability to schedule the inspection tasks of one year on a sparse graph with thousand nodes and arcs is assessed.
منابع مشابه
A Path-Generation Matheuristic for Large Scale Evacuation Planning
In this study we present a general matheuristic that decomposes the problem being solved in a master and a subproblem. In contrast with the column generation technique, the proposed approach does not rely on the explicit pricing of new columns but instead exploits features of the incumbent solution to generate one or more columns in the master problem. We apply this approach to large scale evac...
متن کاملA Matheuristic Approach for Solving the Railroad Hump Yard Block-to-Track Assignment
This paper presents a novel matheuristic for solving the Hump Yard Block-to-Track Assignment Problem. This is an important problem rising in the railway freight industry and involves scheduling the transitions of a set of rail cars from a set of inbound trains to a set of outbound trains over a certain planning horizon. It was also the topic of the 2014 challenge organised by the Railway Applic...
متن کاملA matheuristic approach to integrate humping and pullout sequencing operations at railroad hump yards
This article presents a novel matheuristic for solving the hump yard block-to-track assignment problem. This is an important problem arising in the railway freight industry and involves scheduling the transitions of a set of rail cars from a set of inbound trains to a set of outbound trains over a certain planning horizon. It was also the topic of the 2014 challenge organized by the Railway App...
متن کاملSolving a Freight Railcar Flow Problem Arising in Russia
We consider a variant of the freight railcar flow problem. In this problem, we need 1) to choose a set of transportation demands between stations in a railroad network, and 2) to fulfill these demands by appropriately routing the set of available railcars, while maximizing the total profit. We formulate this problem as a multi-commodity flow problem in a large space-time graph. Three approaches...
متن کاملScale Multicommodity Capacitated Fixed-Charge Network Design
We present a branch-and-price-and-cut algorithm for solving large-scale instances of the multicommodity capacitated fixed-charge network design problem. The restricted master problem solved at each column generation iteration is obtained directly from the compact arc-based model by considering only a subset of the commodity flow variables. The pricing subproblem corresponds to a Lagrangian rela...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Networks
دوره 66 شماره
صفحات -
تاریخ انتشار 2015